Constraint programming have been identifying as promising technique for efficiently solving discrete optimization problem

Constraint programming has roots in logic programming, where a model both declarative and procedural interpretation. A is because its statements can be read as logical propositions that describe the problem, it processed instructions for how to find solution. To make constraint material practical problems one needs propagation algorithms are viable proficient. The most incredible algorithm alldifferent constraint, i.e. getting hyper-circular segment consistency, sure extremely productive. reason we apply matching hypothesis from operations research. Likewise symmetric weighted powerful effective exist, again dependent on techniques From this paper show some time more easy way solve MIP. For will choose an auction strategy by which company get revenue.Despite considerable progress, there remains great potential further integration, with concomitantimprovement modeling solution method.